A Comparison of some Methods for Solving Linear Interval Equations
نویسندگان
چکیده
منابع مشابه
A Comparison of Some Methods for Solving Linear Interval Equations∗
Certain cases in which the interval hull of a system of linear interval equations can be computed inexpensively are outlined. We extend a proposed technique of Hansen and Rohn with a formula that bounds the solution set of a system of equations whose coefficient matrix A = [A, A] is an H-matrix; when A is centered about a diagonal matrix, these bounds are the smallest possible (i.e., the bounds...
متن کاملMethods For Interval Linear Equations
We discuss one known and five new interrelated methods for bounding the hull of the solution set of a system of interval linear equations. Each method involves a polynomial amount of computing; but requires considerably more effort than Gaussian elimination. However, each method can yield sharper results for appropriate problems. For certain problems, our methods can obtain sharp bounds for one...
متن کاملComparison of some Preconditioned Krylov Methods for Solving Sparse Non-symmetric Linear Systems of Equations
Large sparse non-symmetric linear systems of equations often occur in many scientific and engineering applications. In this paper, we present a comparative study of some preconditioned Krylov iterative methods, namely CGS, Bi-CGSTAB, TFQMR and GMRES for solving such systems. To demonstrate their efficiency, we test and compare the numerical implementations of these methods on five numerical exa...
متن کاملA matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
متن کاملFast Methods for Solving Linear Diophantine Equations
We present some recent results from our research on methods for finding the minimal solutions to linear Diophantine equations over the naturals. We give an overview of a family of methods we developed and describe two of them, called Slopes algorithm and Rectangles algorithm. From empirical evidence obtained by directly comparing our methods with others, and which is partly presented here, we a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 1997
ISSN: 0036-1429,1095-7170
DOI: 10.1137/s0036142994270995